منابع مشابه
Finite Field Multiplier Using Redundant Representation
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclotomic ring which has a basis with the elegant multiplicative structure of a cyclic group. One important feature of our architectures is that they provide area-time trade-offs which enable us to implement the multiplier...
متن کاملA Bit-Serial Word-Parallel Finite Field Multiplier
A high speed bit-serial word-parallel finite field multiplier using redundant basis is proposed. It has been shown that the proposed architecture has higher speed compared to the previously proposed hybrid architectures using the same basis while having moderate complexity. The hybrid architecture of the proposed design provides designer the ability to set the trade off between area and delay d...
متن کاملEfficient Semi-Systolic Finite Field Multiplier Using Redundant Basis
The arithmetic operations over GF (2) have been extensively used in error correcting codes and public-key cryptography schemes. Finite field arithmetic includes addition, multiplication, division and inversion operations. Addition is very simple and can be implemented with an extremely simple circuit. The other operations are much more complex. The multiplication is the most important for crypt...
متن کاملLow-Complexity Versatile Finite Field Multiplier in Normal Basis
A low-complexity VLSI array of versatile multiplier in normal basis over GF(2n) is presented. The finite field parameters can be changed according to the user’s requirement andmake themultiplier reusable in different applications. It increases the flexibility to use the same multiplier for different applications and reduces the user’s cost. The proposed multiplier has a regular structure and is...
متن کاملA Scalable and Unified Multiplier Architecture
We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF (p) and GF (2). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF (p). The multiplier is scalable, which means that a fixed-area multiplication module can handle operands of any size, and also, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Latin America Transactions
سال: 2008
ISSN: 1548-0992
DOI: 10.1109/tla.2008.4917435